منابع مشابه
Uncertainty and filtering of hidden Markov models in discrete time
We consider the problem of filtering an unseen Markov chain from noisy observations, in the presence of uncertainty of the parameters of the processes involved. Using the theory of nonlinear expectations, we describe the uncertainty in terms of a penalty function, which can be propagated forward in time alongside the filter. We then study the approximation of this penalty, and give a simple num...
متن کاملComputation of Ruin Probabilities for General Discrete-time Markov Models
We study the ruin problem over a risk process described by a discrete-time Markov model. In contrast to previous studies that focused on the asymptotic behaviour of ruin probabilities for large values of the initial capital, we provide a new technique to compute the quantity of interest for any initial value, and with any given precision. Rather than focusing on a particular model for risk proc...
متن کاملDiscrete Time Markov Processes
What follows is a quick survey of the main ingredients in the theory of discrete-time Markov processes. It is a birds' view, rather than the deenitive \state of the art." To maximize accessibility, the nomenclature of mathematical probability is avoided, although rigor is not sacriiced. To compensate, examples (and counterexamples) abound and the bibliography is annotated. Relevance to control ...
متن کاملDiscrete Time Homogeneous and non-Homogeneous semi-Markov Reliability Models.∗
In this paper, we extend to our knowledge, for the first case, some reliability results obtained using homogeneous semi-Markov processes to the case of non-homogenous semi-Markov modelisation. Moreover, we apply some of our preceding results to give the numerical solutions and so the possibility to treat real life problems for which non-homogeneity in time is important.
متن کاملMinimal Critical Subsystems for Discrete-Time Markov Models
We propose a new approach to compute counterexamples for violated ω-regular properties of discrete-time Markov chains and Markov decision processes. Whereas most approaches compute a set of system paths as a counterexample, we determine a critical subsystem that already violates the given property. In earlier work we introduced methods to compute such subsystems based on a search for shortest p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Southeast Europe Journal of Soft Computing
سال: 2013
ISSN: 2233-1859
DOI: 10.21533/scjournal.v2i1.43